Incrementally Updateable and Persistent Decomposition of OWL Ontologies

نویسندگان

  • Pavel Klinov
  • Chiara Del Vescovo
  • Thomas Schneider
چکیده

The paper focuses on practical aspects of decomposing OWL ontologies into logically coherent fragments, called atoms, and maintaining large ontologies in the decomposed form. While the recently proposed atomic decomposition exhibits some very attractive formal properties and promises important applications, e.g., module extraction, its practical applicability has been far from clear. Two particular concerns are the necessity to recompute the decomposition upon every change to the logical content of the ontology and the lack of methods for managing the decomposed structure in a persistent storage. This paper describes tools which addresses both issues: an algorithm for incremental updates to the atomic decomposition (with a preliminary empirical evaluation) and an approach to its persistence in a RDF store or an XML database.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HyS: Fast Atomic Decomposition and Module Extraction of OWL-EL ontologies

In this paper, we present HyS, an application for fast atomic decomposition and module extraction of OWL-EL ontologies. HyS computes a hypergraph representation of the modular structure of an ontology. This hypergraph representation contains the atomic decomposition of the input ontology, and it allows to extract modules for a given signature. We provide an experimental evaluation of HyS with a...

متن کامل

Storing OWL Ontologies in SQL Relational Databases

Relational databases are often used as a basis for persistent storage of ontologies to facilitate rapid operations such as search and retrieval, and to utilize the benefits of relational databases management systems such as transaction management, security and integrity control. On the other hand, there appear more and more OWL files that contain ontologies. Therefore, this paper proposes to ex...

متن کامل

A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL

Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we propose a decomposition-based approach to optimizing existing OWL DL reasoners in evaluating conjunctive queries in OWL DL ontologies. The main idea is to decompose a given OWL DL ontology into a set of target ontologies ...

متن کامل

A Protégé Plugin for Querying and Reasoning on Persistent OWL Ontologies

The OWL language [1] is being widely used to define ontologies in the Web. This language provides three increasingly expressive sublanguages, namely OWL Lite, OWL-DL and OWL Full. The OWL-DL XML based syntax together with its correspondence with Description Logics (DL) [2], make it a good candidate to be the standard language for defining ontologies used by Semantic Web applications. However, t...

متن کامل

OntoVQL: A Graphical Query Language for OWL Ontologies

The database usability experience has shown that visual query languages tend to be superior to textual languages in many aspects. By applying this principle in the context of ontologies, we present OntoVQL, a graphical query language for OWL-DL ontologies. OntoVQL maps diagrammatic queries to DL based query languages such as nRQL, which is offered by the OWL-DL reasoner Racer. OntoVQL hides the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012